A Comprehensive Empirical Comparison of Parallel ListSieve and GaussSieve

نویسندگان

  • Artur Mariano
  • Özgür Dagdelen
  • Christian H. Bischof
چکیده

The security of lattice-based cryptosystems is determined by the performance of practical implementations of, among others, algorithms for the Shortest Vector Problem (SVP). In this paper, we conduct a comprehensive, empirical comparison of two SVP-solvers: ListSieve and GaussSieve. We also propose a practical parallel implementation of ListSieve, which achieves super-linear speedups on multi-core CPUs, with efficiency levels as high as 183%. By comparing our implementation with a parallel implementation of GaussSieve, we show that ListSieve can, in fact, outperform GaussSieve for a large number of threads, thus answering a question that was still open to this day.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sieving for Shortest Vectors in Ideal Lattices

Lattice based cryptography is gaining more and more importance in the cryptographic community. It is a common approach to use a special class of lattices, so-called ideal lattices, as the basis of lattice based crypto systems. This speeds up computations and saves storage space for cryptographic keys. The most important underlying hard problem is the shortest vector problem. So far there is no ...

متن کامل

Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing

By replacing the brute-force list search in sieving algorithms with Charikar’s angular localitysensitive hashing (LSH) method, we get both theoretical and practical speedups for solving the shortest vector problem (SVP) on lattices. Combining angular LSH with a variant of Nguyen and Vidick’s heuristic sieve algorithm, we obtain heuristic time and space complexities for solving SVP in dimension ...

متن کامل

Comparison of Thermal Dispersion Effects for Single and two Phase Analysis of Heat Transfer in Porous Media

The present work involves numerical simulation of a steady, incompressible forcedconvection fluid flow through a matrix of porous media between two parallel plates at constanttemperature. A Darcy model for the momentum equation was employed. The mathematical model forenergy transport was based on single phase equation model which assumes local thermal equilibriumbetween fluid and solid phases. ...

متن کامل

An Empirical Comparison of Distance Measures for Multivariate Time Series Clustering

Multivariate time series (MTS) data are ubiquitous in science and daily life, and how to measure their similarity is a core part of MTS analyzing process. Many of the research efforts in this context have focused on proposing novel similarity measures for the underlying data. However, with the countless techniques to estimate similarity between MTS, this field suffers from a lack of comparative...

متن کامل

Optimization of the Kinematic Sensitivity and the Greatest Continuous Circle in the Constant-orientation Workspace of Planar Parallel Mechanisms

This paper presents the results of a comprehensive study on the efficiency of planar parallel mechanisms, considering their kinetostatic performance and also, their workspace. This aim is approached upon proceeding single- and multi-objective optimization procedures. Kinetostatic performances of ten different planar parallel mechanisms are analyzed by resorting to a recent index, kinematic sens...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2014  شماره 

صفحات  -

تاریخ انتشار 2014